Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, such as greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.

This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way.

Multiwavelength Optical Networks systematically studies the major research issues in WDM (Wavelength Division Multiplexing) optical networks, such as routing and wavelength assignment, QoS multicast routing, design of logical topologies, and placement of wavelength converters. The book consists of two parts. The first part studies the fundamental concepts and principles of WDM networks. The second part discusses advanced and research issues of WDM networks.
The authors of the book have many years of working experience in the areas of computer networks and network optimization. The book discusses many difficult issues of WDM networks in a very comprehensive way. For each problem, there is a background discussion, and then the mathematical formulation, followed by the solutions.

The 14th Annual International Computing and Combinatorics Conference, CO- COON2008, tookplaceinDalian, China, June27-29,2008.PastCOCOONc- ferences were held in Xi'an (1995), Hong Kong (1996), Shanghai (1997), Taipei (1998), Tokyo (1999), Sydney (2000), Guilin (2001), Singapore (2002), Montana (2003), Jeju Island (2004), Kunming (2005), Taipei (2006), and Alberta (2007). COCOON 2008 provided a forum for researchers working in the areas of - gorithms, theory of computation, computational complexity, and combinatorics related to computing. The Program Committee received 172 submissions from 26 countries and regions: Canada, Australia, Austria, Brazil, China, Denmark, France, Germany, HongKong, Hungary, India, Iran, Israel, Japan, Korea, Mexico, Morocco, Netherlands, Pakistan, Singapore, Spain, Switzerland, Taiwan, Ukraine, the UK, and USA. With the help of 116 external referees, each submission was reviewed by at least two Program Committee members or external referees. Of the 172 subm- sions,66paperswereselectedforpresentationintheconferenceandareincluded in this volume. Some of these will be selected for publication in a special issue of Algorithmica and a special issue of the Journal of Combinatorial Optimization under the standard refereeing procedure. In addition to the selected papers, the conference also included two invited presentations by Der-Tsai Lee (Academia Sinica, Taiwan) and Takao Nishizeki (Tohoku University, Japan). The best paper awards were given for "Visual Cryptography on Graphs" to Lu, Manchala and Ostrovsky, and for "A Linear Programming Duality - proach to Analyzing Strictly Nonblocking d-ary Multilog Networks under G- eral Crosstalk Constraints" to Ngo, Wang and Le.

Multiwavelength Optical Networks systematically studies the major research issues in WDM (Wavelength Division Multiplexing) optical networks, such as routing and wavelength assignment, QoS multicast routing, design of logical topologies, and placement of wavelength converters. The book consists of two parts. The first part studies the fundamental concepts and principles of WDM networks. The second part discusses advanced and research issues of WDM networks.
The authors of the book have many years of working experience in the areas of computer networks and network optimization. The book discusses many difficult issues of WDM networks in a very comprehensive way. For each problem, there is a background discussion, and then the mathematical formulation, followed by the solutions.